Support Vector Machine for Fast Fractal Image Compression Base on Structure Similarity

نویسندگان

  • Chih-Ming Kung
  • Shu-Tsung Chao
چکیده

Fractal image compression is promising both theoretically and practically. The encoding speed of the traditional full search method is a key factor rendering the fractal image compression unsuitable for real-time application. The primary objective of this paper is to investigate the comprehensive coverage of the principles and techniques of fractal image compression, and describes the implementation of a pre-processing strategy that can reduce the full searching domain blocks by training the Support Vector Machine which could recognized the self-similar pattern feature to enhance the domain block searching efficiency. In this paper, the novel image quality index (Structure Similarity, SSIM) and block property classifier based on SVM employed for the fractal image compression is investigated. Experimental results show that the scheme speeds up the encoder 15 times faster and the visual effect is better in comparison to the full search method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iteration Free Fractal Image Compression For Color Images Using Vector Quantization, Genetic Algorithm And Simulated Annealing

This research paper on iteration free fractal image compression for color images using the techniques Vector Quantization, Genetic Algorithm and Simulated Annealing is proposed, for lossy compression, to improve the decoded image quality, compression ratio and reduction in coding time. Fractal coding consists of the representation of image blocks through the contractive transformation coefficie...

متن کامل

Fractal Image Compression an Introductory Overview

Fractal image compression is a new technique for encoding images compactly. It builds on local self-similarities within images. Image blocks are seen as rescaled and intensity transformed approximate copies of blocks found elsewhere in the image. This yields a self-referential description of image data, which | when decoded | shows a typical fractal structure. This paper provides an elementary ...

متن کامل

Faster Fractal Image Coding Using Similarity Search in a KL-transformed Feature Space

Fractal coding is an eecient method of image compression but has a major drawback: the very slow compression phase, due to a time-consuming similarity search between image blocks. A general acceleration method based on feature vectors is described, of which we can nd many instances in the literature. This general method is then optimized using the well-known Karhunen-Loeve expansion, allowing o...

متن کامل

Efficient Fractal Image Coding using Fast Fourier Transform

The fractal coding is a novel technique for image compression. Though the technique has many attractive features, the large encoding time makes it unsuitable for real time applications. In this paper, an efficient algorithm for fractal encoding which operates on entire domain image instead of overlapping domain blocks is presented.The algorithm drastically reduces the encoding time as compared ...

متن کامل

Performance Evaluation of Fractal Feature in Recognition of Postal Codes Using an RBF Neural Network and SVM Classifier

This paper presents a new method for isolated Farsi/Arabic characters and digits recognition. Fractal codes which are determined by a fractal encoding method are used as feature in this system. Fractal image compression is a relatively recent technique based on the representation of an image by a contractive transform for which the fixed point is close to the original image. Each fractal code c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JSW

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2010